Tractable and Consistent Random Graph Models
نویسندگان
چکیده
منابع مشابه
Tractable and Consistent Random Graph Models
We define a general class of network formation models, Statistical Exponential Random Graph Models (SERGMs), that nest standard exponential random graph models (ERGMs) as a special case. We provide the first general results on when these models’ (including ERGMs) parameters estimated from the observation of a single network are consistent (i.e., become accurate as the number of nodes grows). Ne...
متن کاملConvex Random Graph Models
We propose a principled framework for designing random graph models from minimal assumptions. Our central principle is to study the uniform measure over symmetric subsets of graphs. The symmetries we require are far less limiting than those in existing graph models and flexible enough to encompass both geometric features and properties of graph limits. Our main contribution is to derive natural...
متن کاملExponential random graph models
Synonyms p* models, p-star models, p1 models, exponential family of random graphs, maximum entropy random networks, logit models, Markov graphs Glossary • Graph and network: the terms are used interchangeably in this essay. • Real-world network: (real network, observed network) means network data the researcher has collected and is interested in modelling. • Ensemble of graphs: means the set of...
متن کاملRandom graph models for the web graph
One of the most extensively researched real-world networks is the web graph. The web graph has vertices representing web pages, with edges corresponding to the links between pages. We describe some of the key properties of the web graph and propose models to simulate its evolution. We survey more recent work on geometric models, where nodes occupy some geometric space and edges are created via ...
متن کاملModels of random graph hierarchies
We introduce two models of inclusion hierarchies: Random Graph Hierarchy (RGH) and Limited Random Graph Hierarchy (LRGH). In both models a set of nodes at a given hierarchy level is connected randomly, as in the Erdős-Rényi random graph, with a fixed average degree equal to a system parameter c. Clusters of the resulting network are treated as nodes at the next hierarchy level and they are conn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2012
ISSN: 1556-5068
DOI: 10.2139/ssrn.2150428